The Frobenius Number for Jacobsthal Triples Associated with Number of Solutions
نویسندگان
چکیده
In this paper, we find a formula for the largest integer (p-Frobenius number) such that linear equation of non-negative coefficients composed Jacobsthal triplet has at most p representations. For p=0, problem is reduced to famous Diophantine Frobenius, which called Frobenius number. We also give closed number integers (p-genus), equations have Extensions polynomial and Jacobsthal–Lucas more general formulas include familiar Fibonacci Lucas numbers. A basic with was dealt by Marin, Ramírez Alfonsín M. P. Revuelta p=0 Komatsu Ying p.
منابع مشابه
The Frobenius Coin Problem Upper Bounds on The Frobenius Number
In its simplest form, the coin problem is this: what is the largest positive amount of money that cannot be obtained using two coins of specified distinct denominations? For example, using coins of 2 units and 3 units, it is easy so see that every amount greater than or equal to 2 can be obtained, but 1 cannot be obtained. Using coins of 2 units and 5 units, every amount greater than or equal t...
متن کاملThe relationship between the distinguishing number and the distinguishing index with detection number of a graph
This article has no abstract.
متن کاملOn the number of solutions of the Diophantine equation of Frobenius – General case ∗
We determine the number of solutions of the equation a1x1+a2x2+ · · ·+amxm = b in non-negative integers x1, x2, . . ., xn. If m = 2, then the largest b for which no solution exists is a1a2 − a1 − a2, and an explicit formula for the number of solutions is known. In this paper we give the method for computing the desired number. The method is illustrated with several examples.
متن کاملThe Number of Additive Triples in Subsets of Abelian Groups
A set of elements of a finite abelian group is called sum-free if it contains no Schur triple, i.e., no triple of elements x, y, z with x + y = z. The study of how large the largest sum-free subset of a given abelian group is had started more than thirty years before it was finally resolved by Green and Ruzsa a decade ago. We address the following more general question. Suppose that a set A of ...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Axioms
سال: 2023
ISSN: ['2075-1680']
DOI: https://doi.org/10.3390/axioms12020098